منابع مشابه
Mapping gene family data onto evolutionary trees
RÉSUMÉ. Des modèles pour placer les données des familles de genes individuelles sur un arbre d'espèces évolutionnaires sont presentés. Une famille de gènes est, tipiquement, observée comme un ensemble de proteins homologue, qui appartient aux espèces differentes, qui veut dire que des données dans la forme de (a) une matrice de distance entre protéines, ou (b) un arbre de "gènes", dérivé de cet...
متن کاملParticularly Friendly Members of Family Trees
The last decade has witnessed many clever constructions of parameterized families of pairing-friendly elliptic curves that now enable implementors targeting a particular security level to gather suitable curves in bulk. However, choosing the best curves from a (usually very large) set of candidates belonging to any particular family involves juggling a number of efficiency issues, such as the n...
متن کاملA new species of the family Mesopsocidae (Insecta: Psocoptera) on ash trees from Iran
در بررسی تنوع گونهای بندپایان درختان زبان گنجشک در شهرستان مشهد و حومه، نمونههایی از شپشهای چوب و کتاب در اسفند سال 1392جمع‌آوری شد که توسط پروفسور Charles Lienhard از موزه تاریخ طبیعی سوئیس با نام علمی Mesopsocus hiemalis Marikowskii (Psocoptera: Mesopsocidae) شناسایی گردید. این خانواده، جنس و گونه برای اولین‌بار از ایران گزارش می‌شود.
متن کاملAnalogical Inferences in the Family Trees Task: A Review
We reviewed the performance results on a generalization test obtained by Hinton in a pioneering study of perceptrons’ capacity to make analogical inferences. In that test, a five-layer feed-forward network was exposed to items that were not part of its training set (i.e., four relationships between members of two genealogically identical families), to see whether it could nevertheless generaliz...
متن کاملBandwidth Approximation of a Restricted Family of Trees
Bandwidth is one of the canonical NP-complete problems [17]. It is NP-hard to approximate within any constant, even on trees [22]. Gupta gave a randomized approximation algorithm [8] for bandwidth on trees, which has an approximation ratio of O(log n). This algorithm has the best currently known approximation ratio on trees. Gupta showed that his algorithm has an approximation ratio of O(log n)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Biochemist
سال: 2007
ISSN: 0954-982X,1740-1194
DOI: 10.1042/bio02904042